Performance Analysis of Odd-even Merge Sort by Using Openmp, Mpi and Concurrent Java

Sorting is a method which arranges the list of elements into a particular order. sorting has two different meanings ordering and categorizing, ordering means to order the list of same items and categorizing means grouping and labeling the same type of items[2]. sorting is used in other algorithms that require sorted list to work efficiently. The odd-even merge sort algorithm was developed by K.E. Batcher [1]. Odd even merge sort algorithm can be used for the construction of a systematic sorting network. To construct a systematic sorting network, it is necessary to construct a comparison network that can sort any odd-even sequence. The main idea of this algorithm is that first it sorts the odd position list and the even position list, finally it combines the two sorted list into a single sorted sequence by using a merge algorithm. In this paper we tried to parallelize this sorting algorithm into three different modules that is openmp, mpi and concurrent java and compared the results of sequence implementation with parallel. II. ODD-EVEN MERGE SORT: Algorithm for oddeven merge sort Input: sequence t0, ..., ti-1 of length i>1 whose two halves t0, ..., ti/2-1 and ti/2, ..., t i-1 are sorted (i a multiple of 2) Output: sorted sequence